Social optimality and cooperation in nonatomic congestion games

نویسنده

  • Igal Milchtaich
چکیده

Congestion externalities may result in non-optimal equilibria. For these to occur, it suffices that facilities differ in their fixed utilities or costs. As this paper shows, the only case in which equilibria are always socially optimal, regardless of the fixed components, in that in which the costs increase logarithmically with the size of the set of users. Therefore, achieving a socially optimal choice of facilities generally requires some form of external intervention or cooperation. For heterogeneous populations (in which the fixed utilities or costs vary across users as well as across facilities), this raises the question of utility or cost sharing. The sharing rule proposed in this paper is the Harsanyi transferable-utility value of the game—which is based on the users’ marginal contributions to the bargaining power of coalitions. Journal of Economic Literature Classification Numbers: C71, C72, D62.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Bounding the inefficiency of equilibria in nonatomic congestion games

Equilibria in noncooperative games are typically inefficient, as illustrated by the Prisoner’s Dilemma. In this paper, we quantify this inefficiency by comparing the payoffs of equilibria to the payoffs of a “best possible” outcome. We study a nonatomic version of the congestion games defined by Rosenthal [15], and identify games in which equilibria are approximately optimal in the sense that n...

متن کامل

The Impact of Collusion on the Price of Anarchy in Nonatomic and Discrete Network Games

Hayrapetyan, Tardos andWexler recently introduced a framework to study the impact of collusion in congestion games on the quality of Nash equilibria. We adopt their framework to network games and focus on the well established price of anarchy as a measure of this impact. We rst investigate nonatomic network games with coalitions. For this setting, we prove upper bounds on the price of anarchy f...

متن کامل

X Weighted Congestion Games: The Price of Anarchy, Universal Worst-Case Examples, and Tightness

We characterize the price of anarchy (POA) in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this quantity as is already known for nonatomic and unweighted congestion games, and take the form of universal (cost function-independent) worst-case examples. One noteworthy byproduct of our proofs is the fact that...

متن کامل

Weighted Congestion Games: Price of Anarchy, Universal Worst-Case Examples, and Tightness

We characterize the price of anarchy in weighted congestion games, as a function of the allowable resource cost functions. Our results provide as thorough an understanding of this quantity as is already known for nonatomic and unweighted congestion games, and take the form of universal (cost function-independent) worst-case examples. One noteworthy byproduct of our proofs is the fact that weigh...

متن کامل

A geometric approach to the price of anarchy in nonatomic congestion games

We present a short, geometric proof for the price-of-anarchy results that have recently been established in a series of papers on selfish routing in multicommodity flow networks and on nonatomic congestion games. This novel proof also facilitates two new types of theoretical results: On the one hand, we give pseudo-approximation results that depend on the class of allowable cost functions. On t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Economic Theory

دوره 114  شماره 

صفحات  -

تاریخ انتشار 2004